A faster dual algorithm for the Euclidean minimum covering ball problem
نویسندگان
چکیده
Dearing and Zeck [5] presented a dual algorithm for the problem of the minimum covering ball in R. Each iteration of their algorithm has a computational complexity of at least O(n). In this paper we propose a modification to their algorithm that, together with an implementation that uses updates to the QR factorization of a suitable matrix, achieves a O(n) iteration.
منابع مشابه
Approximating Smallest Enclosing Balls with Applications to Machine Learning
In this paper, we first survey prior work for computing exactly or approximately the smallest enclosing balls of point or ball sets in Euclidean spaces. We classify previous work into three categories: (1) purely combinatorial, (2) purely numerical, and (3) recent mixed hybrid algorithms based on coresets. We then describe two novel tailored algorithms for computing arbitrary close approximatio...
متن کاملA branch-and-bound algorithm for the minimum radius $k$-enclosing ball problem
The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points in a general n-dimensional Euclidean space. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. The nodes on the tree are ordered in a suitable way, which, complemented with a last-in-first-out search strat...
متن کاملPerformance Evaluation: Ball-Treeand KD-Tree in the Context of MST
Now a day’s many algorithms are invented / being inventing to find the solution for Euclidean Minimum Spanning Tree (EMST) problem, as its applicability is increasing in much wide range of fields containing spatial / spatio – temporal data viz. astronomy which consists of millions of spatial data. To solve this problem, we are presenting a technique by adopting the dual tree algorithm for findi...
متن کاملOn the Fractality of Complex Networks: Covering Problem, Algorithms and Ahlfors Regularity
In this paper, we revisit the fractality of complex network by investigating three dimensions with respect to minimum box-covering, minimum ball-covering and average volume of balls. The first two dimensions are calculated through the minimum box-covering problem and minimum ball-covering problem. For minimum ball-covering problem, we prove its NP-completeness and propose several heuristic algo...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017